Morphic congruences and D0L languages
نویسندگان
چکیده
منابع مشابه
Results Concerning Thinness of D0l Languages
A language L is called thin if there exists an integer n0 such that for all n n0 L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin. TUCS Research Group Mathematical...
متن کاملCongruences for Visibly Pushdown Languages
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the syntactic congruence for regular languages such that this congruence is of finite index if, and only if, L is a VPL. We then study the problem of finding canonical minimal determ...
متن کاملCongruences Defined by Languages and Filters
The usual right congruence :"L can be generalized in the following manner: x ~£: ,LY :¢> {z t xz e L ~:~yz eL} ~,LP, where ~9 ° is a family of languages. It turns out to be useful when £# is a falter with an additional property. Furthermore semifilters are introduced and studied. It is also possible to define congruences by filters. Assuming the (right) congruences to have finite index yields a...
متن کاملFormations of Monoids, Congruences, and Formal Languages
The main goal in this paper is to use a dual equivalence in automata theory started in [RBBCL13] and developed in [BBCLR14] to prove a general version of the Eilenberg-type theorem presented in [BBPSE12]. Our principal results confirm the existence of a bijective correspondence between formations of (non-necessarily finite) monoids, that is, classes of monoids closed under taking epimorphic ima...
متن کاملBispecial factors in circular non-pushy D0L languages
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent. keywords: bispecial factors, circular D0L systems, non-pushy D0L systems, cri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00110-3